ABS-type methods for solving full row rank linear systems using a new rank two update
نویسندگان
چکیده
منابع مشابه
A new multi-step ABS model to solve full row rank linear systems
ABS methods are direct iterative methods for solving linear systems of equations, where the i-th iteration satisfies the first i equations. Thus, a system of m equations is solved in at most m ABS iterates. In 2004 and 2007, two-step ABS methods were introduced in at most [((m+1))/2] steps to solve full row rank linear systems of equations. These methods consuming less space, are more compress ...
متن کاملA note on extended reduced rank-two Abaffian update schemes in the ABS-type methods
The ABS methods, introduced by Abaffy, Broyden and Spedicato, are direct iteration methods for solving a linear system where the ith iterate satisfies the first i equations, therefore a system of m equations is solved in at most m steps. Recently, we have presented a new approach to devise a class of ABS-type methods for solving full row rank systems [K. Amini, N. Mahdavi-Amiri, M. R. Peyghami,...
متن کاملa new type-ii fuzzy logic based controller for non-linear dynamical systems with application to 3-psp parallel robot
abstract type-ii fuzzy logic has shown its superiority over traditional fuzzy logic when dealing with uncertainty. type-ii fuzzy logic controllers are however newer and more promising approaches that have been recently applied to various fields due to their significant contribution especially when the noise (as an important instance of uncertainty) emerges. during the design of type- i fuz...
15 صفحه اولTruncated low-rank methods for solving general linear matrix equations
This work is concerned with the numerical solution of large-scale linear matrix equations A1XB T 1 + · · ·+ AKXB K = C. The most straightforward approach computes X ∈ Rm×n from the solution of an mn×mn linear system, typically limiting the feasible values of m,n to a few hundreds at most. Our new approach exploits the fact that X can often be well approximated by a low-rank matrix. It combines ...
متن کاملGreedy low-rank methods for solving general linear matrix equations‡
This work is concerned with the numerical solution of large-scale linear matrix equations A1XB T 1 + · · ·+ AKXB K = C. The most straightforward approach computes X ∈ Rm×n from the solution of an mn×mn linear system, typically limiting the feasible values of m,n to a few hundreds at most. Our new approach exploits the fact that X can often be well approximated by a low-rank matrix. It combines ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Australian Mathematical Society
سال: 2004
ISSN: 0004-9727,1755-1633
DOI: 10.1017/s0004972700035784